Finding robust vertices for 3D synchronization based on Euclidean minimum spanning tree
نویسندگان
چکیده
Synchronization in 3D data hiding is one of the main problems. We need to know where we can embed information, and be able to find this space in order to extract the message. Various algorithms propose synchronization techniques by triangle or vertex path in a 3D mesh. In this paper, we proposed a new synchronization technique based on Euclidean minimum spanning tree computing (EMST) and the analysis of the displacement of the vertices without moving the connections in the tree. Based on the analysis of the vertices, we select the most robust vertices and synchronize these areas by computing a new EMST called ”robust EMST”. Then, we analyze the robustness of the technique, i.e. the stability of the most robust vertices selection; and demonstrate the consistence of the criterion selection with the vertex displacement.
منابع مشابه
A Metaheuristic Algorithm for the Minimum Routing Cost Spanning Tree Problem
The routing cost of a spanning tree in a weighted and connected graph is defined as the total length of paths between all pairs of vertices. The objective of the minimum routing cost spanning tree problem is to find a spanning tree such that its routing cost is minimum. This is an NP-Hard problem that we present a GRASP with path-relinking metaheuristic algorithm for it. GRASP is a multi-start ...
متن کاملFast Heuristics for Large Instances of the Euclidean Bounded Diameter Minimum Spanning Tree Problem
Given a connected, undirected graph G = (V, E) on n = |V | vertices, an integer bound D ≥ 2 and non-zero edge weights associated with each edge e ∈ E, a bounded diameter minimum spanning tree (BDMST) on G is defined as a spanning tree T⊆ E on G of minimum edge cost w(T) =∑w(e), ∀ e∈ T and tree diameter no greater than D. The Euclidean BDMST Problem aims to find the minimum cost BDMST on graphs ...
متن کاملAn Approximation Scheme for the Generalized Geometric Minimum Spanning Tree Problem with Grid Clustering
This paper is concerned with a special case of the Generalized Minimum Spanning Tree Problem. The Generalized Minimum Spanning Tree Problem is defined on an undirected graph, where the vertex set is partitioned into clusters, and non-negative costs are associated with the edges. The problem is to find a tree of minimum cost containing exactly one vertex in each cluster. We consider a geometric ...
متن کاملA Sausage Heuristic for Steiner Minimal Trees in Three-Dimensional Euclidean Space
Given a set V of size N 4 vertices in a metric space, how can one interconnect them with the possible use of a set S of size M vertices not in the set V , but in the same metric space, so that the cumulative cost of the inter-connections between all the vertices is a minimum? When one uses the Euclidean metric to compute these inter-connections, this is referred to as the Euclidean Steiner Mini...
متن کاملA Permutation-Coded Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem
The diameter of a tree is the largest number of edges on any path between two vertices in it. Given a weighted, connected, undirected graph G and a bound D ≥ 2, the bounded-diameter minimum spanning tree problem seeks a spanning tree on G of minimum weight whose diameter does not exceed D. An evolutionary algorithm for this NP-hard problem encodes candidate trees as permutations of their vertic...
متن کامل